#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
int a[N];
ll c[32][32];
void init_cmb() {
  rep(i, 0, 30) c[i][0] = 1;
  rep(i, 1, 30) rep(j, 1, i) c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
}

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  init_cmb();
  while (cin >> n) {
    int sum = 0;
    ll ans = 1;
    for (int i = 2; i * i <= n; i++) {
      if (n % i) continue;
      int k = 0;
      while (n % i == 0) k++, n /= i;
      sum += k;
      ans *= c[sum][k];
    }
    if (n > 1) ans *= ++sum;
    cout << sum << ' ' << ans << endl;
  }
  return 0;
}
